Reformulating Action Language C+ in Answer Set Programming

نویسنده

  • Joohyung Lee
چکیده

Action language C+ is a high level notation of nonmonotonic causal logic for describing properties of actions. The definite fragment of C+ is implemented in Version 2 of the Causal Calculator (CCALC) based on the reduction of nonmonotonic causal logic to propositional logic. On the other hand, here we present two reformulations of the definite fragment of C+ in terms of different versions of the stable model semantics. The first reformulation is in terms of the recently proposed stable model semantics of formulas with intensional functions, and can be encoded in the input language of CSP solvers. The second reformulation is in terms of the stable model semantics of propositional logic programs, which can be encoded in the input language of ASP systems. The second one is obtained from the first one by eliminating intensional functions in favor of intensional predicates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reformulating Temporal Action Logics in Answer Set Programming

Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergies it brings. First, the reformulation provides a means to compute TAL using efficient answer set solvers. Second, TAL provides a structured high-level language for ASP (possibly with constraint solving). Third, the re...

متن کامل

Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming

Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action formalisms, such as the situation calculus, the event calculus and temporal action logics; the latter has served as a basis of a family of action languages, such as language A and several of its descendants. Based on the ...

متن کامل

Action Language BC+

Action languages are formal models of parts of natural language that are designed to describe effects of actions. Many of these languages can be viewed as high level notations of answer set programs structured to represent transition systems. However, the form of answer set programs considered in the earlier work is quite limited in comparison with the modern Answer Set Programming (ASP) langua...

متن کامل

Extending Action Language C+ by Formalizing Composite Actions

This paper extends action language C+ by introducing composite actions as sequential execution of primitive actions. Such extension leads to a more intuitive and flexible way to represent action domains, better exploit a general-purpose formalization, and improve the reasoning efficiency for large domains. The semantics of composite actions is defined by a translation to nonmonotonic causal the...

متن کامل

Characterizing Causal Action Theories and Their Implementations in Answer Set Programming: Action Languages B, C, and Beyond

We consider a simple language for writing causal action theories, and postulate several properties for the state transition models of these theories. We then consider some possible embeddings of these causal action theories in some other action formalisms, and their implementations in logic programs with answer set semantics. In particular, we propose to consider what we call permissible transl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012